منابع مشابه
On the Iterated Hairpin Completion
The (bounded) hairpin completion and its iterated versions are operations on formal languages which have been inspired by the hairpin formation in DNA-biochemistry. The paper answers two questions asked in the literature about the iterated hairpin completion. The first question is whether the class of regular languages is closed under iterated bounded hairpin completion. Here we show that this ...
متن کاملOn Some Algorithmic Problems Regarding the Hairpin Completion
It is known that a single stranded DNA molecule might produce a hairpin structure due to two biological principles, namely Watson-Crick complementarity and annealing. In many DNA-based algorithms, these DNA molecules cannot be used in the subsequent computations. Hairpin or hairpin-free DNA structures have numerous applications to DNA computing and molecular genetics. Suggested by the two afore...
متن کاملCompletion and amalgamation of bounded distributive quasi lattices
In this note we present a completion for the variety of bounded distributive quasi lattices, and, inspired by a well-known idea of L.L. Maksimova [14], we apply this result in proving the amalgamation property for such a class of algebras.
متن کاملImproved Bounded Matrix Completion for Large-Scale Recommender Systems
Matrix completion is a widely used technique for personalized recommender systems. In this paper, we focus on the idea of Bounded Matrix Completion (BMC) which imposes bounded constraints into the standard matrix completion problem. It has been shown that BMC works well for several real world datasets, and an efficient coordinate descent solver called BMA has been proposed in [R. Kannan and Par...
متن کاملIt is NL-Complete to Decide Whether a Hairpin Completion of Regular Languages is Regular
The hairpin completion is an operation on formal languages which is inspired by the hairpin formation in biochemistry. Hairpin formations occur naturally within DNA-computing. It has been known that the hairpin completion of a regular language is linear context-free, but not regular, in general. However, for some time it is was open whether the regularity of the hairpin completion of a regular ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2011
ISSN: 0890-5401
DOI: 10.1016/j.ic.2010.11.014